Reversible Computing: Foundations and Software
نویسندگان
چکیده
منابع مشابه
Foundations of Generalized Reversible Computing
Information loss from a computation implies energy dissipation due to Landauer’s Principle. Thus, increasing the amount of useful computational work that can be accomplished within a given energy budget will eventually require increasing the degree to which our computing technologies avoid information loss, i.e., are logically reversible. But the traditional definition of logical reversibility ...
متن کاملReversible Term Rewriting: Foundations and Applications
Essentially, in a reversible programming language, for each forward computation step from state S to state S′, there exists a constructive and deterministic method to go backwards from state S′ to state S. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or qu...
متن کاملDNA Computing - Foundations and Implications
DNA computing is an area of natural computing based on the idea that molecular biology processes can be used to perform arithmetic and logic operations on information encoded as DNA strands. The aim of this review is two-fold. First, we introduce the fundamentals of DNA computing, including basics of DNA structure and bio-operations, and two historically important DNA computing experiments. Sec...
متن کاملReversible Computing - Fundamentals, Quantum Computing, and Applications
Make more knowledge even in less time every day. You may not always spend your time and money to go abroad and get the experience and knowledge by yourself. Reading is a good alternative to do in getting this desirable knowledge and experience. You may gain many things from experiencing directly, but of course it will spend much money. So here, by reading reversible computing fundamentals quant...
متن کاملInteractive Foundations of Computing
The claim that interactive systems have richer behavior than algorithms is surprisingly easy to prove: Turing machines cannot model interaction machines because: interaction is not expressible by a finite initial input string. Interaction machines extend the Chomsky hierarchy, are modeled by interaction grammars, and precisely capture fuzzy concepts like open systems and empirical computer scie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Generation Computing
سال: 2018
ISSN: 0288-3635,1882-7055
DOI: 10.1007/s00354-018-0035-5